ACS-PRM: Adaptive Cross Sampling Based Probabilistic Roadmap for Multi-robot Motion Planning
نویسندگان
چکیده
In this paper we present a novel approach for multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, we call ACSPRM, consists of three steps, which are C-space sampling, roadmap building and motion planning. Firstly, an adequate number of points should be generated in C-space on an occupancy grid map by using an adaptive cross sampling method. Secondly, a roadmap should be built while the potential targets and the milestones are extracted by second learning the result of sampling. Finally, the motion of robots should be planned by querying the constructed roadmap. In contrast to previous approaches, our ACS-PRM approach is designed to plan separate kinematic paths for multiple robots to minimize the problem of congestion and collision in an effective way so as to improve the planning efficiency. Our approach has been implemented and evaluated in simulation. The experimental results demonstrate the total planning time can be significantly reduced by our ACSPRM approach compared with previous approaches. keywords: multi-agent system, motion planning, multi-robot coordination, sampling-based approach
منابع مشابه
Towards a Probabilistic Roadmap for Multi-robot Coordination
In this paper, we discuss the problem of multirobot coordination and propose an approach for coordinated multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, called ACS-PRM, is a samplingbased method and consists of three steps including Cspace sampling, roadmap building and motion planning. In contrast to previous app...
متن کاملToggle PRM: A Simultaneous Mapping of CFree and CObstacle for Use in Probabilistic Roadmap Methods
Motion planning for robotic applications is difficult. This is a widely studied problem in which the best known deterministic solution is doubly exponential in the dimensionality of the problem. A class of probabilistic planners, called sampling-based planners, have shown much success in this area, but still show weakness for planning in difficult parts of the space, namely narrow passages. The...
متن کاملOn the Probabilistic Foundations of Probabilistic Roadmaps
Probabilistic roadmap (PRM) planners [5, 16] solve apparently difficult motion planning problems where the robot's configuration space C has dimensionality six or more, and the geometry of the robot and the obstacles is described by hundreds of thousands of triangles. While an algebraic planner would be overwhelmed by the high cost of computing an exact representation of the free space F , defi...
متن کاملAdaptive Strategies for Probabilistic Roadmap Construction
This paper presents an experimental study of prospects for using adaptable local search techniques in probabilistic roadmap based motion planning. The classical PRM approach uses a single fast and simple local planner to build a network representation of the configuration space. Advanced PRM planners utilize heuristic sampling techniques and combine multiple local planners. The planner describe...
متن کاملQuasi-Randomized Path Planning
We propose the use of quasi-random sampling techniques for path planning in high-dimensional conng-uration spaces. Following similar trends from related numerical computation elds, we show several advantages ooered by these techniques in comparison to random sampling. Our ideas are evaluated in the context of the probabilistic roadmap (PRM) framework. Two quasi-random variants of PRM-based plan...
متن کامل